Robust feature selection via nonconvex sparsity-based methods
نویسندگان
چکیده
منابع مشابه
Efficient Sparse Group Feature Selection via Nonconvex Optimization
Sparse feature selection has been demonstrated to be effective in handling high-dimensional data. While promising, most of the existing works use convex methods, which may be suboptimal in terms of the accuracy of feature selection and parameter estimation. In this paper, we expand a nonconvex paradigm to sparse group feature selection, which is motivated by applications that require identifyin...
متن کاملRobust Feature Matching and Selection Methods
1. INTRODUCTION Multisensor image registration is necessary in many applications of remote sensing imagery, whose crucial problem is how to establish the correspondence between the features extracted from the reference and input images. Most existing methods only consider how to extract features, however, the quality of the features are ignored. In this paper, we combine scale invariant feature...
متن کاملFeature Selection, Sparsity, Regression Regularization
from Wikipedia A feature selection algorithm can be seen as the combination of a search technique for proposing new feature subsets, along with an evaluation measure which scores the different feature subsets. The simplest algorithm is to test each possible subset of features finding the one which minimizes the error rate. This is an exhaustive search of the space, and is computationally intrac...
متن کاملPrediction of blood cancer using leukemia gene expression data and sparsity-based gene selection methods
Background: DNA microarray is a useful technology that simultaneously assesses the expression of thousands of genes. It can be utilized for the detection of cancer types and cancer biomarkers. This study aimed to predict blood cancer using leukemia gene expression data and a robust ℓ2,p-norm sparsity-based gene selection method. Materials and Methods: In this descriptive study, the microarray ...
متن کاملDirect Sparsity Optimization Based Feature Selection for Multi-Class Classification
A novel sparsity optimization method is proposed to select features for multi-class classification problems by directly optimizing a l2,p -norm ( 0 < p ≤ 1 ) based sparsity function subject to data-fitting inequality constraints to obtain large between-class margins. The direct sparse optimization method circumvents the empirical tuning of regularization parameters in existing feature selection...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of nonlinear and variational analysis
سال: 2021
ISSN: ['2560-6778', '2560-6921']
DOI: https://doi.org/10.23952/jnva.5.2021.1.05